Antisymmetries in the realization of Boolean functions
نویسندگان
چکیده
New symmetries of degree two are introduced, along with spectral techniques for identifying these symmetries. Some applications of these symmetries are discussed, in particular their application to the construction of binary decision diagrams and the implementation of Boolean functions.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملOn completely robust path delay fault testable realization of logic functions
A large class of Boolean functions, as well as almost all symmetr ic Boolean functions, are shown to have no two-level completely robust path-delay-fault testable ( R P D F T ) realization b y combinational circuits. Exact and asymptotic formulae are derived fo r the number of symmetric Boolean functions which have two-level completely R P D F T realization. To achieve completely R P D F T real...
متن کاملCombinatorial method for Boolean SAC functions designing
In this paper a new approach for designing Boolean functions that satisfy the Strict Avalanche Criterion (SAC) is presented. The advantage of the suggested approach is the simplicity of its realization and the significant greater number of the generated functions compared to the known methods. The formalized procedure for construction of nonbalanced and balanced SAC-functions is described in de...
متن کاملRealization and bifurcation of Boolean Functions via Cellular Neural Networks
In this work, we study the realization and bifurcation of Boolean functions of four variables via a Cellular Neural Network (CNN). We characterize the basic relations between the genes and the offsets of an uncoupled CNN as well as the basis of the binary input vectors set. Based on the analysis, we have rigorously proved that there are exactly 1882 linearly separable Boolean functions of four ...
متن کاملAِ New Technique for Realization of Boolean Functions
In previous work [23,24], a fast systematic method for minimization of the Boolean functions was presented. Such method is a simple because there is no need for any visual representation such as Karnough map or arrangement technique such as Tabulation method. Furthermore, it is very easy and fast for programming. In addition, it is suitable for boolean function with large number of variables (m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002